Octasection-based Refinement of Finite Element Approximations on Tetrahedral Meshes that Guarantees Shape Quality

نویسندگان

  • Lance Endres
  • Petr Krysl
چکیده

Adaptive refinement of finite element approximations on tetrahedral meshes is generally considered to be a non-trivial task. (We wish to stress that this paper deals with mesh refinement as opposed to remeshing.) The splitting individual finite elements needs to be done with much care to prevent significant deterioration of the shape quality of the elements of the refined meshes. Considerable complexity thus results, which makes it difficult to design (and even more importantly, to later maintain) adaptive tetrahedra-based simulation codes. An adaptive refinement methodology, dubbed CHARMS (Conforming Hierarchical Adaptive Refinement MethodS), had recently been proposed by Krysl, Grinspun, and Schröder. The methodology streamlines and simplifies mesh refinement, since conforming (compatible) meshes always result by construction. The present work capitalizes on these conceptual developments to build a mesh refinement technique for tetrahedra. Shape quality is guaranteed for an arbitrary number of refinement levels due to our use of element octasection based on the Kuhn triangulation of the cube. Algorithms and design issues related to the inclusion of the present technique in a CHARMS-based object oriented software framework (http://hogwarts.ucsd.edu/~pkrysl/CHARMS) are described.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On Nonobtuse Refinements of Tetrahedral Finite Element Meshes

It is known that piecewise linear continuous finite element (FE) approximations on nonobtuse tetrahedral FE meshes guarantee the validity of discrete analogues of various maximum principles for a wide class of elliptic problems of the second order. Such analogues are often called discrete maximum principles (or DMPs in short). In this work we present several global and local refinement techniqu...

متن کامل

An Introduction to Mesh Quality

The issue of mesh quality for unstructured triangular and tetrahedral meshes is considered. The theoretical background to finite element methods is used to understand the basis of present-day geometrical mesh quality indicators. Simple tetrahedral mesh quality measures using both geometrical and solution information are described. Some of the issues in mesh quality for unstructured tetrahedral ...

متن کامل

Multithread Lepp-Bisection Algorithm for Tetrahedral Meshes

Longest edge refinement algorithms were designed to deal with the iterative and local refinement of triangulations for finite element applications. In 3-dimensions the algorithm locally refines a tetredra set Sref and some neighboring tetraedra in each iteration. The new points introduced in the mesh are midpoints of the longest edge of some tetrahedra of either of the input mesh or of some ref...

متن کامل

A Fast Algorithm for Generating Large Tetrahedral 3D Finite Element Meshes from Magnetic Resonance Tomograms

This paper addresses the problem of generating threedimensional (3D) finite element (FE) meshes from medical voxel datasets. With our background in cognitive neuroscience, we deal with brain MR tomograms of up to 256 voxels which contain a multitude of incompletely definable, complex-shaped objects. We describe an algorithm that allows the fast and stable creation of very large 3D meshes with w...

متن کامل

A Proposal for a Dissertation on Tetrahedral/Hexahedral Finite Element Meshing from Volumetric Imaging Data

The proposed research for the Computational Engineering and Sciences (CES) option of the Computational and Applied Mathematics (CAM) Ph.D. program is in the area of tetrahedral/hexahedral finite element meshing from volumetric imaging data with defined boundaries. The proposed research work is to extract adaptive tetrahedral and hexahedral finite element meshes with guaranteed quality directly ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2003